283 research outputs found
Compressive Parameter Estimation for Sparse Translation-Invariant Signals Using Polar Interpolation
We propose new compressive parameter estimation algorithms that make use of
polar interpolation to improve the estimator precision. Our work extends
previous approaches involving polar interpolation for compressive parameter
estimation in two aspects: (i) we extend the formulation from real non-negative
amplitude parameters to arbitrary complex ones, and (ii) we allow for mismatch
between the manifold described by the parameters and its polar approximation.
To quantify the improvements afforded by the proposed extensions, we evaluate
six algorithms for estimation of parameters in sparse translation-invariant
signals, exemplified with the time delay estimation problem. The evaluation is
based on three performance metrics: estimator precision, sampling rate and
computational complexity. We use compressive sensing with all the algorithms to
lower the necessary sampling rate and show that it is still possible to attain
good estimation precision and keep the computational complexity low. Our
numerical experiments show that the proposed algorithms outperform existing
approaches that either leverage polynomial interpolation or are based on a
conversion to a frequency-estimation problem followed by a super-resolution
algorithm. The algorithms studied here provide various tradeoffs between
computational complexity, estimation precision, and necessary sampling rate.
The work shows that compressive sensing for the class of sparse
translation-invariant signals allows for a decrease in sampling rate and that
the use of polar interpolation increases the estimation precision.Comment: 13 pages, 5 figures, to appear in IEEE Transactions on Signal
Processing; minor edits and correction
Compressive Time Delay Estimation Using Interpolation
Time delay estimation has long been an active area of research. In this work,
we show that compressive sensing with interpolation may be used to achieve good
estimation precision while lowering the sampling frequency. We propose an
Interpolating Band-Excluded Orthogonal Matching Pursuit algorithm that uses one
of two interpolation functions to estimate the time delay parameter. The
numerical results show that interpolation improves estimation precision and
that compressive sensing provides an elegant tradeoff that may lower the
required sampling frequency while still attaining a desired estimation
performance.Comment: 5 pages, 2 figures, technical report supporting 1 page submission for
GlobalSIP 201
Compressive Sensing for Spread Spectrum Receivers
With the advent of ubiquitous computing there are two design parameters of
wireless communication devices that become very important power: efficiency and
production cost. Compressive sensing enables the receiver in such devices to
sample below the Shannon-Nyquist sampling rate, which may lead to a decrease in
the two design parameters. This paper investigates the use of Compressive
Sensing (CS) in a general Code Division Multiple Access (CDMA) receiver. We
show that when using spread spectrum codes in the signal domain, the CS
measurement matrix may be simplified. This measurement scheme, named
Compressive Spread Spectrum (CSS), allows for a simple, effective receiver
design. Furthermore, we numerically evaluate the proposed receiver in terms of
bit error rate under different signal to noise ratio conditions and compare it
with other receiver structures. These numerical experiments show that though
the bit error rate performance is degraded by the subsampling in the CS-enabled
receivers, this may be remedied by including quantization in the receiver
model. We also study the computational complexity of the proposed receiver
design under different sparsity and measurement ratios. Our work shows that it
is possible to subsample a CDMA signal using CSS and that in one example the
CSS receiver outperforms the classical receiver.Comment: 11 pages, 11 figures, 1 table, accepted for publication in IEEE
Transactions on Wireless Communication
Validating a real-time perceptual model predicting distraction caused by audio-on-audio interference
Source Coding in Networks with Covariance Distortion Constraints
We consider a source coding problem with a network scenario in mind, and
formulate it as a remote vector Gaussian Wyner-Ziv problem under covariance
matrix distortions. We define a notion of minimum for two positive-definite
matrices based on which we derive an explicit formula for the rate-distortion
function (RDF). We then study the special cases and applications of this
result. We show that two well-studied source coding problems, i.e. remote
vector Gaussian Wyner-Ziv problems with mean-squared error and mutual
information constraints are in fact special cases of our results. Finally, we
apply our results to a joint source coding and denoising problem. We consider a
network with a centralized topology and a given weighted sum-rate constraint,
where the received signals at the center are to be fused to maximize the output
SNR while enforcing no linear distortion. We show that one can design the
distortion matrices at the nodes in order to maximize the output SNR at the
fusion center. We thereby bridge between denoising and source coding within
this setup
- âŚ